Faith & falsity
نویسنده
چکیده
A theory T is trustworthy iff, whenever a theory U is interpretable in T , then it is faithfully interpretable. In this paper we provide a characterization of trustworthiness. We provide a simple proof of Friedman’s Theorem that finitely axiomatized, sequential, consistent theories are trustworthy. We provide an example of a theory whose schematic predicate logic is complete Π2.
منابع مشابه
108 Terence Horgan And
In debate over the truth or falsity of folk psychology (henceforth, FP, a notation which also will go proxy for 'folk psychological'), the most influential players tend to line up on the U.S. coasts: friends of FP, like Jerry Fodor and William Lycan, on the East; foes, like Paul Churchland, Patricia Churchland, and Stephen Stich until recently, on the W e s t . 1 There are important voices in o...
متن کاملNeural Network Regression Based on Falsity Input
In general, only the truth input is used to train neural network. This paper applies both truth and falsity input, which is the complement of the truth input, to train neural network to solve regression problems. Four neural networks are created. The first two networks are trained using the truth input to predict the truth and falsity outputs based on the truth and falsity targets, respectively...
متن کاملApplying Falsity Input to Neural Networks to Solve Single Output Regression Problems
In this paper, both truth and falsity inputs are used to trained neural networks. Falsity input is the complement of the truth input. Two pairs of neural networks are created. The first pair of neural networks are trained using the truth input whereas the second pair of neural networks are trained using the falsity input. Each pair of neural networks are trained to predict degree of truth and d...
متن کاملComplexity of Semialgebraic Proofs with Restricted Degree of Falsity
A weakened version of the Cutting Plane (CP) proof system with a restriction on the degree of falsity of intermediate inequalities was introduced by Goerdt. He proved an exponential lower bound for CP proofs with degree of falsity bounded by n log2 n+1 , where n is the number of variables. Hirsch and Nikolenko strengthened this result by establishing a direct connection between CP and Resolutio...
متن کاملDual Intuitionistic
We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson’s logic takes both truth and falsity as constructive notions, in the falsificati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 131 شماره
صفحات -
تاریخ انتشار 2005